A New Hybrid Method for Mobile Robot Dynamic Local Path Planning in Unknown Environment

نویسندگان

  • Peng Li
  • Xinhan Huang
  • Min Wang
چکیده

In this paper, a hybrid approach for efficiently planning smooth local paths for mobile robot in an unknown environment is presented. The single robot is treated as a multi-agent system, and the corresponding architecture with cooperative control is constructed. And then a new method of information fusion namely DSmT (Dezert-Smarandache Theory) which is an extension of the DST (Dempster-Shafer Theory) is introduced to deal with the error laser readings. In order to make A* algorithm suitable for local path planning, safety guard district search method and optimizing approach for searched paths are proposed. Also, the parameters of internal ProportionalIntegral-Derivative (PID) controller in the goto agent are adjusted through practical experiments for the use of smoothing the path searched by optimized A* algorithm. Finally, two kinds of experiments are carried out with Pioneer 2-DXe mobile robot: one uses the hybrid method proposed in this paper, the other uses artificial potential field (APF) which is the classical algorithm for local path planning. The experimental results reveal the validity and superiority of the hybrid method for dynamic local path planning. The approach presented in this paper provides an academic support for path planning in dynamic environment with moving objects in the field.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Method of Mobile Robot Navigation: Shortest Null Space

In this paper, a new method was proposed for the navigation of a mobile robot in an unknown dynamic environment. The robot could detect only a limited radius of its surrounding with its sensors and it went on the shortest null space (SNS) toward the goal. In the case of no obstacle, SNS was a direct path from the robot to goal; however, in the presence of obstacles, SNS was a space around the r...

متن کامل

A New Method of Mobile Robot Navigation: Shortest Null Space

In this paper, a new method was proposed for the navigation of a mobile robot in an unknown dynamic environment. The robot could detect only a limited radius of its surrounding with its sensors and it went on the shortest null space (SNS) toward the goal. In the case of no obstacle, SNS was a direct path from the robot to goal; however, in the presence of obstacles, SNS was a space around the r...

متن کامل

An Integrated Algorithm for Autonomous Navigation of a Mobile Robot in an Unknown Environment

Global path planning algorithms are good in planning an optimal path in a known environment, but would fail in an unknown environment and when reacting to dynamic and unforeseen obstacles. Conversely, local navigation algorithms perform well in reacting to dynamic and unforeseen obstacles but are susceptible to local minima failures. A hybrid integration of both the global path planning and loc...

متن کامل

Short-Safe Compromise Path for Mobile Robot Navigation In A Dynamic Unknown Environment

This paper presents a path planning method for a mobile robot in an environment that is unknown and can change. This method relies on continually sensing the local environment. Robot and personnel safety is a dominant and essential requirement for this path planning method. A new method for obtaining safe directions in a tessellated map of the environment is introduced. Linear combination of ve...

متن کامل

Obstacle Prediction–based Dynamic Path Planning for a Mobile Robot

A path-planning method based on a combination of the static global and the dynamic local pathplanning methods is proposed for robot path planning under a complex environment. There are known static obstacles and unknown dynamic obstacles in any complex environment. The local-path planner dynamically generates a local path using obstacle-motion prediction and a rolling window for dynamic path pl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JCP

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2010